How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases?
نویسندگان
چکیده
Managing inconsistency in DL-Lite knowledge bases where the assertional base is prioritized is a crucial problem in many applications. This is especially true when the assertions are provided by multiple sources having different reliability levels. This paper first reviews existing approaches for selecting preferred repairs. It then focuses on suitable strategies for handling inconsistency in DL-Lite knowledge bases. It proposes new approaches based on the selection of only one preferred repair. These strategies have as a starting point the so-called nondefeated repair and add one of the following principles: deductive closure, consistency, cardinality and priorities. Lastly, we provide a comparative analysis followed by an experimental evaluation of the studied approaches.
منابع مشابه
Non Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases
Possibilistic DL-Lite is an extension of the DL-Lite framework to deal with uncertain pieces of information. In this paper, we deal with inconsistency in DL-Lite in case where the assertions are uncertain and encoded in a possibility theory framework. We investigate three inconsistency-tolerant reasoning methods for possibilistic DL-Lite knowledge bases which are based on the selection of one c...
متن کاملMin-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases
DL-Lite is a powerful and tractable family of description logics specifically tailored for applications that use huge volumes of data. In many real world applications, data are often provided by several and potentially conflicting sources of information having different levels of priority. Possibility theory offers a very natural framework to deal with ordinal and qualitative uncertain beliefs ...
متن کاملMerging Incommensurable Possibilistic DL-Lite Assertional Bases
This short paper studies the problem of merging of different independent data sources linked to a lightweight ontology under the incommensurability assumption. In general, data are often provided by several and potentially conflicting sources of information having different levels of priority. To encode prioritized assertional bases, we use possibilistic DLLite logic. We investigate an egalitar...
متن کاملAssertional-based Removed Set Revision of DL-LiteR Belief Bases
DL-Lite is a tractable fragment of Description Logics, which provides a powerful framework to compactly encode available knowledge with a low computational complexity of the reasoning process. Belief revision is an important problem that appears in many applications and especially in the semantic web area. This paper investigates the so-called “Removed Sets Revision” for revising DL-Lite knowle...
متن کاملQuery-Driven Repairing of Inconsistent DL-Lite Knowledge Bases
We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...
متن کامل